Problèmes NP-difficiles : approximation modérément exponentielle et complexité paramétrique. (NP-Hard problems : moderately exponential approximation and parameterized complexity)
نویسنده
چکیده
Vangelis Th. PASCHOS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Directeur de thèse Bruno ESCOFFIER . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Co-Directeur de thèse Éric ANGEL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Rapporteur Federico DELLA CROCE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Rapporteur Mathieu LIEDLOFF . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Membre du jury Yann VAXÈS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Membre du jury Stéphane VIALETTE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .Membre du jury
منابع مشابه
Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation
The main objective of the polynomial approximation is the development of polynomial time algorithms for NP-hard problems, these algorithms guaranteeing feasible solutions lying “as near as possible” to the optimal ones. This work is the fist part of a couple of papers where we introduce the key-concepts of the polynomial approximation and present the main lines of a new formalism. Our purposes ...
متن کاملAutour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances
This paper is the continuation of the paper “Autour de nouvelles notions pour l’analyse des algorithmes d’approximation: Formalisme unifié et classes d’approximation” where a new formalism for polynomial approximation and its basic tools allowing an “absolute” (individual) evaluation the approximability properties of NPhard problems have been presented and discussed. In order to be used for exh...
متن کاملApproximation of min coloring by moderately exponential algorithms
We present in this note a rather new way to cope with polynomial inapproximability of NP-hard problems. We study approximation of min coloring by moderately exponential time algorithms, able to achieve approximation ratios unachievable in polynomial time for min coloring by algorithms with provably upper complexity bounds, better than those of exact resolution.
متن کاملStrong computational lower bounds via parameterized complexity
We develop new techniques for deriving strong computational lower bounds for a class of well-known NP-hard problems. This class includes weighted satisfiability, dominating set, hitting set, set cover, clique, and independent set. For example, although a trivial enumeration can easily test in time O(nk) if a given graph of n vertices has a clique of size k, we prove that unless an unlikely coll...
متن کاملSemi-Definite positive Programming Relaxations for Graph Kn-Coloring in Frequency Assignment
In this paper we will describe a new class of coloring problems, arising from military frequency assignment, where we want to minimize the number of distinct n-uples of colors used to color a given set of n-complete-subgraphs of a graph. We will propose two relaxations based on Semi-Definite Programming models for graph and hypergraph coloring, to approximate those (generally) NP-hard problems,...
متن کامل